Extended non-return-to-zero serial channel signaling

ABSTRACT

Methods and apparatus for serial channel operation are disclosed. An N+1-level signaling scheme is used to transmit N staggered but overlapping NRZ sub-sequences concurrently on a serial channel. Each sequence has a bit rate R and an essential bandwidth of R Hz. The combined bit rate of the channel is N×R, but due to a lack of correlation between the sub-sequences, the essential bandwidth remains approximately R Hz. The signaling scheme also contains redundancy that allows some errors to be detected and/or corrected. Other embodiments are also described and claimed.

CROSS REFERENCE TO RELATED APPLICATION

The present application claims priority to and is a divisional of co-owned, co-pending U.S. patent application Ser. No. 12/077,615 filed Mar. 20, 2008, (attorney docket no. 16356.1315), the disclosure of which is incorporated herein by reference.

BACKGROUND

1. Field of the Invention

The present disclosure relates generally to serial channel coding, and more particularly to techniques for transmitting and receiving a data sequence across an electrical serial channel.

2. Description of Related Art

For purposes of this disclosure, a serial channel in an electronic system comprises a signal path between a transmitter that transmits a single data stream containing all information necessary to receive the data stream and a receiver that receives the data stream. A typical serial channel transmitter transmits a series of equally-spaced symbols at a given symbol rate R. The receiver recovers the symbol rate and symbol timing from the received data, and uses the recovered timing to detect, for each symbol period, which symbol was transmitted.

A serial channel code determines the symbol sequence that will be transferred across a channel to represent a given data sequence. Serial channel codes require at least two symbols, although some codes use many more symbols. One typical method of transmission assigns a pulse of a given voltage level to each symbol. For high-speed transmission, the channel does not return to a quiescent level between successive symbols—this is known as Non-Return-to-Zero (NRZ) signaling.

FIG. 1A illustrates, for an exemplary binary input data stream S(i), binary channel coding using Pulse Amplitude Modulation (PAM). When S(i)=0, a first symbol amplitude S1 that represents “0” is transmitted, and when S(i)=1, a second symbol amplitude S2 that represents “1” is transmitted. Each symbol has a period T, where T=1/R. When either S1 or S2 is transmitted by sending no signal, this is known as “on-off” signaling. When S1=−S2, this is known as polar signaling. Other symbol choices can result in an offset polar signal that has a DC bias VB, i.e., where S1=2×VB−S2. Any of these signal types can also be transmitted differentially using two conductors, where a 0 is transmitted by sending S1 on the first conductor and sending S2 on the second conductor at the same time, and a 1 is transmitted by sending S2 on the first conductor and sending S1 on the second conductor at the same time.

Pulse Amplitude Modulation can use more than two symbol amplitudes. FIG. 1B shows an example for S(i) and PAM4 (four-level PAM) coding, and FIG. 1C shows an example for S(i) and PAM8 (eight-level PAM) coding. Turning first to PAM4 and FIG. 1B, with four signal levels available, each symbol can transmit two bits of information. One of the four signal levels is assigned to each of the possible two-bit patterns “00,” “01,” “10,” and “11.” S(i) is then transmitted two bits at a time, with each symbol having a period 2 T, e.g., 2/R.

With the FIG. 1C eight-level coding, each PAM8 symbol can transmit three bits of information. One of the eight signal levels is assigned to each of the possible three-bit patterns shown in FIG. 1C. S(i) is then transmitted three bits at a time, with each symbol having a period 3 T, e.g., 3/R. PAM4 and PAM8 can both be transmitted as polar signals or offset polar symbols.

The bandwidth required to transmit a PAM signal is proportional to the symbol rate. For instance, FIG. 2 shows a measured power spectral density (distribution of the transmitted signal power as a function of frequency) for NRZ polar signaling with a symbol rate R=2 Gbps (billion bits/second). The bulk of the transmitted power is concentrated in a main lobe between 0 Hz and 2 GHz. Additional sidelobes exist, with the first sidelobe peaking at about −12 dB around 3 GHz, the second sidelobe peaking at about −14 dB around 5 GHz, etc. (the waveform in this example was sampled at 10 GHz, and thus frequencies beyond 5 GHz are not shown).

The essential bandwidth necessary to transmit the FIG. 2 signal is approximately equal to the main lobe width, e.g., 2 GHz. In other words, should the channel attenuate the higher frequencies more than the main lobe frequencies, it should be possible to reliably receive the signal when noise power is controlled.

The primary advantage of PAM4 and PAM8 is a lower symbol rate, resulting in a proportionally narrower main lobe width, e.g., 1 GHz for PAM4 and 0.67 GHz for PAM8. Thus a channel that may be marginal for NRZ polar at 2 Gbps could perform well for 2 Gbps PAM4, with a 1 Gbps symbol rate, and even better for 2 Gbps PAM8, with a 0.67 Gbps symbol rate. One tradeoff, however, is that when the same symbol spacing used for NRZ is maintained, PAM4 and PAM8 require much more power. Another tradeoff is that the number of signaling levels (and thus transmitter and receiver complexity) increase as 2^(N), wherein N is the number of bits transmitted per symbol. Thus one quickly reaches a point of diminishing returns—the 25% bandwidth decrease available from going from PAM8 (3 bits/symbol) to PAM16 (4 bits/symbol), for example, requires 16 signal levels instead of 8.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention can be best understood by reading the specification with reference to the following Figures, in which:

FIGS. 1A-1C show, respectively, channel coding examples for binary NRZ, PAM4, and PAM8 coding;

FIG. 2 contains a power spectral density (PSD) plot for NRZ polar signaling at 2 Gbps;

FIGS. 3A and 3B contain, respectively, a coding example and PSD plot for a first embodiment;

FIGS. 4A and 4B contain, respectively, a coding example and PSD plot for a second embodiment;

FIG. 5 contains a general block diagram for a serial channel transmitter according to an embodiment;

FIGS. 6A and 6B depict, respectively, a detailed block diagram for a serial channel transmitter embodiment and a timing diagram for the transmitter control signals;

FIGS. 7-9 depict other serial channel transmitter embodiments;

FIGS. 10-12 contain block diagrams for serial channel receiver embodiments; and

FIG. 13 shows a coding example for an alternate embodiment employing pre-coding.

DETAILED DESCRIPTION

As integrated circuit data rates increase, the reliable transport of data between integrated circuits across a serial channel becomes more difficult. Higher data rates have heretofore required higher symbol rates and/or geometrically increasing symbol levels. Higher symbol rates (and the accompanying higher frequencies required) create additional signal loss across the channel, partially manifest as undesirable crosstalk signals appearing on neighboring channels. Additional signal levels either create more crosstalk energy (assuming a fixed minimum signal level spacing and therefore more power) or require better signal-to-noise ratio (SNR) at the receiver. In all such cases, the design and operation of electrical serial channels reach a point where each of the traditional solutions becomes impractical.

An alternate coding scheme that can allow significant decreases in serial channel bandwidth/symbol has now been discovered. This coding scheme is referred to herein as Extended NRZ-N (ENRZ-N) signaling or coding. With ENRZ-N coding, a data stream with a symbol rate of NR is divided into N data sub-streams, each with a symbol rate R. The individual sub-streams are time-shifted with respect to each other (with sub-stream spacing of 1/NR) and transmitted over the same channel concurrently as N time-shifted NRZ pulse sequences. Each sub-stream has an essential bandwidth of R Hz, and because the sub-streams are uncorrelated, the PSD of the combined sequences resembles the PSD of one sequence. Thus the combined data rate realized on the serial channel is NR.

Unlike PAM modulation techniques, which require 2^(N) signaling levels to transmit N-bit symbols, the number of signaling levels required for ENRZ-N is linearly proportional to N (a total of N+1 signaling levels for N sub-streams). Thus ENRZ-3 requires four signal levels, like PAM4, but for a given symbol rate R requires an essential bandwidth of R/3 instead of R/2 for PAM4. ENRZ-4 requires five signal levels, and requires an essential bandwidth of R/4 under similar circumstances. The described methods and hardware can be extended to higher values of N, if so desired.

Another advantage as compared to PAM coding lies in the ability of ENRZ-N to detect, and in some cases correct, transmission errors. This capability is due to the coding quality that, given correct decoding of the preceding N−1 bits, the next received symbol is known to take one of only two possible levels from the N+1 total levels. Other characteristics and advantages that can be realized with embodiments are described below.

FIG. 3A shows, for the same exemplary bit sequence S(i) used to illustrate prior art NRZ, PAM4, and PAM8 signaling, formulation of ENRZ-3 signaling according to an embodiment. Three data sub-streams, S₀(k), S₁(k), and S₂(k), are formed from bit sequence S(i). Although other mappings are possible (as long as the receiver knows the mapping used), in FIG. 3A the input bit sequence is partitioned such that input symbol S(3k+j) maps to sub-stream symbol S_(J)(k). Thus S₀(k), for example, receives the first bit, fourth bit, seventh bit, etc. of S(i).

Each data sub-stream translates to a corresponding NRZ signal, with period 3 T (the period of S(i) is T). Due to the partitioning of bits among the sub-streams, transitions on S₁(k) occur T seconds after transitions on S₀(k), and transitions on S₂(k) occur T seconds after transitions on S₁(k).

To create an ENRZ-3 signal P_(ENRZ-3)(i), the individual NRZ signals corresponding to S₀(k), S₁(k), and S₂(k) are summed. The resulting signal takes values 0, 1, 2, and 3, depending on whether 0, 1, 2, or 3 of the sub-streams are transmitting a 1 at that instant. Each of these values corresponds to a transmitted signal level. Because only one of the sub-streams changes levels at any instant, P_(ENRZ-3)(i) steps smoothly in one-level increments, as compared to PAM4, which has no such constraint.

FIG. 3B shows a measured PSD function for an ENRZ-3 signal generated from a 10,000 bit binary sequence transmitted at 2 Gbps. The main lobe width is 0.67 GHz, and the signal energy envelope is down 13 dB by 1 GHz and down over 22 dB by 3 GHz, as compared to the polar NRZ PSD of FIG. 2, with a main lobe that extends to 2 GHz and a signal energy envelope that is down only 12 dB at 3 GHz.

FIG. 4A shows, for the same exemplary bit sequence S(i) used in prior examples, formulation of ENRZ-4 signaling. Four data sub-streams, S₀(k), S₁(k), S₂(k), and S₃(k) are formed from bit sequence S(i). Although other mappings are possible (as long as the receiver knows the mapping used), in FIG. 4A the input bit sequence is partitioned such that input symbol S(4k+j) maps to sub-stream symbol S_(j)(k). Thus S₀(k), for example, receives the first bit, fifth bit, ninth bit, etc. of S(i).

Each data sub-stream translates to a corresponding NRZ signal, with period 4 T (the period of S(i) is T). Due to the partitioning of bits among the sub-streams, transitions on S₁(k) occur T seconds after transitions on S₀(k), transitions on S₂(k) occur T seconds after transitions on S₁(k), and transitions on S₃(k) occur T seconds after transitions on S₂(k).

To create an ENRZ-4 signal P_(ENRZ-4)(i), the individual NRZ signals corresponding to S₀(k), S₁(k), S₂(k), and S₃(k) are summed. The resulting signal takes values 0, 1, 2, 3, and 4, depending on whether 0, 1, 2, 3, or 4 of the sub-streams are transmitting a 1 at that instant. Because only one of the sub-streams changes levels at any instant, P_(ENRZ-4)(i) steps smoothly in one-level increments.

FIG. 4B shows a measured PSD function for an ENRZ-4 signal generated from a 10,000 bit binary sequence. The main lobe width is 0.5 GHz, and the signal energy envelope is down over 17 dB by 1 GHz and down over 25 dB by 3 GHz, as compared to the polar NRZ PSD of FIG. 2, with a main lobe that extends to 2 GHz and a signal energy envelope that is down only 12 dB at 3 GHz.

ENRZ-N signals for values of N other than 3 and 4 can be constructed using the same principles illustrated in the examples above.

FIG. 5 illustrates the general form of an ENRZ-N transmitter for a binary-coded input data stream S(i). An ENRZ-N coder calculates, from S(i), a coded data stream CS(i) with N+1 levels. A driver translates the N+1-level coded data stream CS(i) to an analog waveform TX(t), e.g., of the type shown in FIGS. 3A and 4A. FIGS. 6A, 7, 8, and 9 illustrate several detailed embodiments for such a transmitter.

FIG. 6A shows a first detailed transmitter embodiment, where the ENRZ-N coder is an ENRZ-4 coder comprising eight buffer registers B0-B7, four sub-multiplexers M₀-M₃, four sub-channel registers SC₀-SC₃, and a control unit CU. The inputs comprise an eight-bit parallel input data stream S(i), an input stream clock SCK, and a START signal. The eight buffer registers B0-B7 receive the bits of the parallel input data stream. The outputs of buffer registers B0 to B3 connect respectively to the 0 inputs of sub-multiplexers M₀-M₃. The outputs of buffer registers B4 to B7 connect respectively to the 1 inputs of sub-multiplexers M₀-M₃. A control line MUXSEL from control unit CU determines whether the 0 inputs or 1 inputs are output from the sub-multiplexers.

The outputs of the sub-multiplexers M₀-M₃ are, respectively, the data sub-streams S₀(k)-S₃(k), and are supplied respectively as inputs to the four sub-channel registers SC₀-SC₃. Each sub-channel register SC_(j) loads a data sub-stream value upon receiving a load signal L_(j) from control unit CU. Each sub-channel register also receives a RESET signal from control unit CU that causes all registers to load a zero value, e.g., upon the receipt of a START signal.

The outputs of the four sub-channel registers are supplied to a differential driver DR. Driver DR reads the codes output by the four sub-channel registers each time it receives a clock signal DRV. Differential driver DR interprets the codes output by the sub-channel registers, e.g., by adding them or using them as an address into a look-up table that instructs driver DR which of its five levels to drive. One of the five levels is driven on an output TX+(t) and its logical inverse is driven on an output TX−(t).

FIG. 6B shows exemplary timing for the control signals of the FIG. 6A transmitter. Each time SCK goes high, a new set of eight symbols from S(i) is latched into B0-B7. The MUXSEL signal is taken low at this time to select the contents of B0-B3 for supply to the sub-channel registers. An internal clock within CU runs at eight times the input clock SCK, and also functions as the DRV signal. On the first falling edge of DRV after SCK goes high, control unit CU strobes L₀, causing SC₀ to load a new value. On the second falling edge of DRV after SCK goes high, control unit CU strobes L₁, causing SC₁ to load a new value. This pattern continues for SC₂ and SC₃ on the next two falling edges of DRV, and then MUXSEL is driven high to select the contents of B4-B7 for supply to the sub-channel registers. The load sequence is repeated for the four sub-channel registers, after which a new set of eight S(i) symbols is latched into B0-B7, and the sequence repeats.

FIG. 7 shows a variation of the FIG. 6 embodiment. Instead of four sub-multiplexers, a single 8-input MUX receives all eight outputs of registers B0-B7. Three MUXSEL lines allow control unit CU to select each register output individually. The single MUX output supplies the data sub-streams to all sub-channel registers, but the separate latch inputs determine which sub-channel registers actually latch the MUX output. This embodiment allows the coder to be initialized such that all four sub-channel registers begin transmitting the first symbol in the data sequence after a START signal is received. The FIG. 7 embodiment can also run as an ENRZ-3 coder, by disabling one of the sub-channel registers (e.g., making its output 0 and then never pulsing its latch signal) and distributing bits from the registers B0-B7 to the remaining three sub-channel registers in round-robin fashion.

FIG. 8 illustrates yet another transmitter embodiment. In FIG. 8, registers B0-B7 are configured as load-shift registers. When SCK transitions high, all registers load a bit from the parallel signal S(i). A SHIFT signal from control unit CU, synchronized but out of phase with DRV, causes the contents of each register Bj to shift to register Bj-1. The SHIFT signal also causes the contents of register B0 to shift to sub-channel register SC₀, the contents of register SC₀ to shift to register SC₁, etc. Although the symbols do not remain resident in the same sub-channel register for four DRV cycles, like in the prior embodiments, each symbol remains resident in the sub-channel registers as a whole for four DRV cycles before shifting out of SC₃. Thus the shift process is mathematically equivalent to the staggered distribution technique of FIGS. 6A and 7.

FIG. 9 illustrates a transmitter embodiment similar to FIG. 8, but simplified for a serial input stream S(i). In this embodiment, S(i) feeds directly into SC₀ and is shifted through the remaining sub-channel registers.

FIG. 9 also illustrates the use of separate NRZ drivers SD₀-SD₃ for each sub-channel register, respectively. An adder function (which can comprise diodes, resistive networks, DC blocking capacitors, etc.) combines the signals from the four NRZ drivers directly to produce the transmitted signal.

FIG. 10 contains a block diagram for a simple ENRZ-N decoder comprising a differential receiver RCV, a subtraction circuit SUB, a shift register SR, and an optional error detection/correction circuit EDC. The receiver receives a differential signal RX+(t), RX−(t) on a differential pair. The receiver recovers the signal timing from the differential signal. The receiver then determines, e.g., by sampling at an appropriate point in each symbol interval, which one of N+1 levels was sent by the transmitter. The sensed level is provided as a coded sample P_(ENRZ)(k) to the subtraction circuit SUB and the error detection/correction circuit EDC.

The coded sample P_(ENRZ)(k) is a sum of overlapping pulses p(k) representing the last N sub-channel pulses:

$\begin{matrix} {{P_{ENRZ}(k)} = {\sum\limits_{i = 0}^{N - 1}{p\left( {k - i} \right)}}} & (1) \end{matrix}$

Given that all prior sub-channel pulses have already been decoded, the current sub-channel pulse can be determined from the current coded sample by rearranging equation 1:

$\begin{matrix} {{p(k)} = {{P_{ENRZ}(k)} - {\sum\limits_{i = 1}^{N - 1}{p\left( {k - i} \right)}}}} & (2) \end{matrix}$

In FIG. 10, prior decoded sub-channel pulses are supplied to a shift register SR, which, in conjunction with SUB, implements equation 2.

A further substitution of equation 1, for coded sample P_(ENRZ)(k−1), shows the relationship between one coded sample and the next:

P _(ENRZ)(k)=P _(ENRZ)(k−1)+p(k)−p(k−N)   (3)

In equation 3, it is evident that only two sub-channel pulses contribute to the difference between one coded sample and the next (the two sub-channel pulses belong to the same sub-channel and are N samples apart in the original data sequence). Thus, from equation 3, if p(k−N) was decoded as a 0,

P _(ENRZ)(k)=P _(ENRZ)(k−1)+p(k)   (4)

P_(ENRZ)(k) can only take two values given equation 4. If p(k)=0, P_(ENRZ)(k) =P_(ENRZ)(k−1). If p(k)=1, P_(ENRZ)(k)=P_(ENRZ)(k−1)+1. Any other value received for P_(ENRZ)(_(k)) indicates that an error has occurred. Likewise from equation 3, if p(k−N) was decoded as a 1,

P _(ENRZ)(k)=P _(ENRZ)(k−1)+p(k)−1   (5)

Again, P_(ENRZ)(k) can only take two values given equation 5. If p(k)=0, P_(ENRZ)(k)=P_(ENRZ)(k−1)−1. If p(k)=1, P_(ENRZ)(k)=P_(ENRZ)(k−1). Any other value received for P_(ENRZ)(k) indicates that an error has occurred.

Based on these observations, error detect/correct circuit EDC can detect some errors in the coded sample stream. First, whether the decoded sub-channel pulses are correct or not, the following must be true for two valid coded samples:

|P _(ENRZ)(k)−P _(ENRZ)(k−1)|<1.5Δ  (6)

where □ is the spacing between neighboring ones of the N signal levels. Second, based on equations 4 and 5, EDC can use comparisons based on the value of p(k−N) to further limit the allowable range of P_(ENRZ)(k):

$\begin{matrix} {{p\left( {k - N} \right)} = \left\{ \begin{matrix} 0 & {{{- 0.5}\Delta} < {{P_{ENRZ}(k)} - {P_{ENRZ}\left( {k - 1} \right)}} < {1.5\Delta}} \\ 1 & {{{- 1.5}\Delta} < {{P_{ENRZ}(k)} - {P_{ENRZ}\left( {k - 1} \right)}} < {0.5\Delta}} \end{matrix} \right.} & (7) \end{matrix}$

When P_(ENRZ)(k) exceeds the allowable range, error detect/correct circuit EDC can assert a signal ERR. Optionally, EDC can attempt to correct such an error by clipping an out-of-range value to be in-range. This can correct some errors, but assumes that an undetected error did not occur on a preceding sample.

FIG. 11 shows an alternate receiver embodiment that includes an integrator INT. Instead of sampling a voltage, e.g., at a sample midpoint, the integrator averages the voltage over a sample interval to arrive at a decoded sample value P_(ENRZ)(k). This has the effect of averaging white noise, which can improve detection performance. The remainder of the receiver functions as described above.

FIG. 12 shows an alternate embodiment that takes a more complex approach to decoding. Each sub-channel pulse actually appears in N successive coded samples. Rather than decoding a sub-channel pulse from the first coded sample that contains it, all coded samples containing a contribution from the sub-channel pulse can be used to determine the value of a sub-channel pulse. Expanding on equation 1 for N consecutive samples,

$\begin{matrix} \begin{matrix} {{\sum\limits_{j = 0}^{N - 1}{P_{ENRZ}\left( {k + j} \right)}} = {\sum\limits_{j = 0}^{N - 1}{\sum\limits_{i = 0}^{N - 1}{p\left( {k - i + j} \right)}}}} \\ {= {{{Np}(k)} + {\sum\limits_{i = 1}^{N - 1}{\left( {N - i} \right){p\left( {k - i} \right)}}} + {\sum\limits_{i = 1}^{N - 1}{\left( {N - i} \right){p\left( {k + i} \right)}}}}} \end{matrix} & (8) \end{matrix}$

FIG. 12 makes use of equation 8 to arrive at a value for p(k) based on some number of coded samples P_(ENRZ)(k). When a new P_(ENRZ)(k) sample arrives, the sample indexes N+1 metrics in a lookup table LUT. Each metric expresses the magnitude of the error that would have to occur for a given group of sub-channel pulse sequences to produce the received value P_(ENRZ)(k). For instance, if N=3 and P_(ENRZ)(k)=3, the distance metric for the sub-channel pulse sequence 111 is 0, the distance metric for the sub-channel pulse sequences 110, 101, and 011 is 1, the distance metric for the sub-channel pulse sequences 001, 010, and 100 is 2, and the distance metric for the sub-channel pulse sequence 000 is 3. In other words, it is most likely that P_(ENRZ)(k) represents 111, but it could represent other sequences with added noise, although it is extremely unlikely that 000 was the sub-channel pulse sequence.

In FIG. 12, a maximum likelihood scorer MLS receives the metrics. By summing metrics for different extended potential sub-channel pulse sequences, MLS can determine a potential sequence with the highest likelihood (lowest summed metric), and use the summed metrics to select a symbol p(k) some number of P_(ENRZ) samples after P_(ENRZ)(k). The selected symbol p(k) can then be fed back to prune the possible pulse sequences for p(k+1), which will be selected next.

Although the prior examples code each data sub-stream using a binary coding, it is possible to pre-code the input data stream to achieve other effects. FIG. 13 shows one example, where an input data stream S(i) is pre-coded to a ternary sequence PK(i). PK(i) copies all “0” samples from S(i) directly. The first N “1” samples are counted and copied, and then the next N “1” samples are counted but copied to PK(i) as “−1” values. FIG. 13 represents an ENRZ-3 coding example, and thus PK(i) alternates “1” and “−1” values in groups of three. Ternary subchannels S₀(k), S₁(k), and S₂(k) are also shown for conceptualization of the frequency content in each subchannel.

The value P_(ENRZ-3)(i) is now computed as a running sum of PK(i). At every sample, P_(ENRZ-3)(i) either holds or steps up one level, until the maximum level is reached. P_(ENRZ-3)(i) then either holds or steps down one level, until the minimum level is reached. This behavior then repeats. The resulting waveform uses the full range of N+1 levels.

The P_(ENRZ-3)(i) values based on this pre-coding are decoded at the receiver as follows. When P_(ENRZ-3)(i)=P_(ENRZ-3)(i−1), p(i) is a 0. When P_(ENRZ-3)(i) □P_(ENRZ-3)(i−1), p(i) is a 1. Errors cannot propagate with this pre-coding. Errors can be detected when the sample sequence reverses from stepping one direction to stepping the other without reaching an end level first.

Those skilled in the art will appreciate that the embodiments and/or various features of the embodiments can be combined in other ways than those described. The ENRZ-N transmitted levels can be selected to be polar or not, and can be transmitted differentially or not. A given embodiment can be used with different values of N at different times. Between message sequences, a preset synchronization sequence can be transmitted on the serial channel. The preset synchronization sequence need not follow ENRZ-N conventions.

Although the specification may refer to “an”, “one”, “another”, or “some” embodiment(s) in several locations, this does not necessarily mean that each such reference is to the same embodiment(s), or that the feature only applies to a single embodiment. 

1. A method of transmitting a data stream, the method comprising: coding an R symbols/second data stream S having data stream values S(i) using a coder, wherein the coding creates a coded data stream CS having N+1 logic levels, wherein N>2, and wherein a coded data stream value CS(i+1) changes by at most one logic level from a logic level of a coded data stream value CS(i); and transmitting the coded data stream CS across an electrical serial channel using a driver, wherein the coded data stream CS is transmitted with signal values corresponding to the N+1 logic levels.
 2. The method of claim 1, wherein a coded data stream value CS(i+N)=CS(i+N−1) when a data stream value S(i)=S(i+N).
 3. The method of claim 1, wherein a coded data stream value CS(i+N)=CS(i+N−1)+1 when a data stream value S(i)<S(i+N), and wherein the coded data stream value CS(i+N)=CS(i+N−1)−1 when the data stream value S(i)>S(i+N).
 4. The method of claim 1, wherein the data stream S is a binary sequence, and wherein the coding the data stream S to create the coded data stream CS comprises pre-coding the data stream S to produce a pre-coded data stream that is a ternary sequence, the precoding comprising mapping N occurrences of the value “1” to a value “1” and then mapping the next N occurrences of the value “1” to a value “−1” in alternating fashion, and mapping all symbols having a value “0” to a value “0,” and performing a modified exclusive-OR operation that changes the coded data stream value CS(i+1) by one logic level relative to the coded data stream value CS(i) when a next pre-coded data symbol is either a “1” or a “−1,” and wherein the direction of the logic level change is determined by the sign of the “1.”
 5. A serial channel transmitter comprising: a coder that is operable to code a data stream S having data stream values S(i) to produce a coded data stream CS having N+1 logic levels, wherein N>2, and wherein a coded data stream value CS(i+1) changes by at most one logic level from a logic level of a coded data stream value CS(i); and a driver that is operable to transmit the coded data stream CS using signal values corresponding to the N+1 logic levels.
 6. The transmitter of claim 5, wherein the coder is operable to produce a coded data stream value CS(i+N)=CS(i+N−1) when a data stream value S(i)=S(i+N), a coded data stream value CS(i+N)=CS(i+N−1)+1 when a data stream value S(i)<S(i+N), and a coded data stream value CS(i+N)=CS(i+N−1)−1 when a data stream value S(i)>S(i+N).
 7. The transmitter of claim 5, wherein the coder includes N sub-coders SC_(J), and wherein 0≦j<N, and wherein when a sub-coder SC₀ is operable to code a data stream value S(i) and a sub-coder SC_(j) is operable to code a data stream value S(i−j).
 8. The transmitter of claim 7, wherein the driver comprises N sub-drivers SD_(j), and wherein 0≦j<N, and wherein each sub-driver SD_(j) is operable to transmit a signal value corresponding to the output of the sub-coder SC_(j), and wherein the driver is operable to sum the outputs of the N sub-drivers SD_(j).
 9. The transmitter of claim 7, wherein the N sub-coders SC_(j) are chained together such that the input of a sub-coder SC_(j) is the output of a sub-coder SC_(j−1), for 0<j<N.
 10. The transmitter of claim 7, wherein the N sub-coders SC_(j) are each clocked at a rate equal to 1/N times a symbol rate R of the data stream S, and the serial channel transmitter further comprises: a demultiplexer that is operable to distribute a plurality of symbols in the data stream S among the N sub-coders SC_(j).
 11. The transmitter of claim 10, wherein the N sub-coders SC_(j) are phased such that a sub-coder SC_(j) is operable to produce a new output value 1/R seconds after a sub-coder SC_(j−1) produces a new output value, for 0<j<N.
 12. The transmitter of claim 5, wherein the data stream S is a binary sequence, and wherein the coding the data stream S to create the coded data stream CS comprises pre-coding the data stream S to produce a pre-coded data stream that is a ternary sequence, the precoding comprising mapping N occurrences of the value “1” to a value “1” and then mapping the next N occurrences of the value “1” to a value “−1” in alternating fashion, and mapping all symbols having a value “0” to a value “0,” and performing a modified exclusive-OR operation that changes the coded data stream value CS(i+1) by one logic level relative to the coded data stream value CS(i) when the next pre-coded data symbol is either a “1” or a “−1,” and wherein the direction of the logic level change is determined by the sign of the “1.”
 13. A method of transmitting a data stream, the method comprising: receiving a data stream S having a plurality of data stream values S(i); forming at least three data sub-streams from the data stream S, wherein each of the at least three data sub-streams are formed from distinct data stream values S(i) of the data stream S such that only one of the at least three data sub-streams changes value in response to the receiving of one of the plurality of data stream value S(i); summing the at least three data sub-streams to created a coded data stream CS using a coder, wherein a coded data stream value CS(i+1) changes by at most one logic level from a logic level of a coded data stream value CS(i) as a result of only one of the at least three data sub-streams changing value in response to the receiving of one of the plurality of data stream value S(i); and transmitting the coded data stream CS across a serial channel using a driver.
 14. The method of claim 13, wherein the at least three data sub-streams comprise three data sub-streams and the data stream S is received at a rate of three data stream values S(i) per data sub-stream period, and wherein a first data sub-stream is formed from a first data stream value S(i) each data sub-stream period, a second data sub-stream is formed from a second data stream value S(i) each data sub-stream period, and a third data sub-stream is formed from a third data stream value S(i) each data sub-stream period.
 15. The method of claim 14, wherein the data stream S comprises a binary sequence having at least 10,000 bits and transmitted at least 2 gigabits per second.
 16. The method of claim 14, wherein the coded data stream CS comprises logic levels of 0, 1, 2, and
 3. 17. The method of claim 13, wherein the at least three data sub-streams comprise four data sub-streams and the data stream S is received at a rate of four data stream values S(i) per data sub-stream period, and wherein a first data sub-stream is formed from a first data stream value S(i) each data sub-stream period, a second data sub-stream is formed from a second data stream value S(i) each data sub-stream period, a third data sub-stream is formed from a third data stream value S(i) each data sub-stream period, and a fourth data sub-stream is formed from a fourth data stream value S(i) each data sub-stream period.
 18. The method of claim 17, wherein the data stream S comprises a binary sequence having at least 10,000 bits and transmitted at least 2 gigabits per second.
 19. The method of claim 17, wherein the coded data stream CS comprises logic levels of 0, 1, 2, 3, and
 4. 20. The method of claim 13, wherein coded data stream CS is transmitted using a bandwidth of less than 1 gigahertz. 